Bio-inspired Membrane Operations in P Systems with Active Membranes

In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time

P Systems with Active Membranes and Separation Rules

The P systems are a class of distributed parallel computing devices of a biochemical type. In this paper, a new de¯nition of separation rules in P systems with active membranes is given. Under the new de¯nition, the e±ciency and universality of P systems with active membranes and separation rules instead of division are investigated

About the Efficiency of Spiking Neural P Systems

Spiking neural P systems were proved to be Turing complete as function computing or number generating devices. Moreover, it has been considered in several papers that spiking neural P systems are also computationally efficient devices working in a non-deterministic way or with exponential pre-computed resources. In this paper, neuron budding rules are introduced in the framework of spiking neural P systems, which is biologically inspired by the growth of dendritic tree of neuron. Using neuron budding rules in SN P systems is a way to trade space for time to solve computational intractable problems. The approach is examined here with a deterministic and polynomial time solution to sat problem without using exponential pre-computed resources

Further Remarks on P Systems with Active Membranes, Separation, Merging, and Release Rules

The P systems are a class of distributed parallel computing devices of a biochemical type. In this note, we show that by using membrane separation to obtain exponential workspace, SAT problem can be solved in linear time in a uniform and con°uent way by active P systems without polarizations. This improves some results already obtained by A. Alhazov, Ts. Ishdorj. A universality result related to membrane separation is also obtained

Deterministic Solutions to QSAT and Q3SAT by Spiking Neural P Systems with Pre-Computed Resources

In this paper we continue previous studies on the computational effciency of spiking neural P systems, under the assumption that some pre-computed resources of exponential size are given in advance. Specifically, we give a deterministic solution for each of two well known PSPACE-complete problems: QSAT and Q3SAT. In the case of QSAT, the answer to any instance of the problem is computed in a time which is linear with respect to both the number n of Boolean variables and the number m of clauses that compose the instance. As for Q3SAT, the answer is computed in a time which is at most cubic in the number n of Boolean variables

Spiking Neural P Systems with Extended Rules

We consider spiking neural P systems with spiking rules allowed to introduce zero, one, or more spikes at the same time. The computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained (universality is already known for the restricted rules), while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of restricted rules). The relationships with regular languages are also investigated. In the end of the paper, a tool-kit for computing (some) operations with languages is provided.Ministerio de Eduación y Ciencia TIN2005-09345-C04-0

Spiking neural P systems with extended rules: universality and languages

We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems and from generating strings; previous results from these areas are briefly recalled. Then, the computing power of the obtained systems is investigated, when considering them as number generating and as language generating devices. In the first case, a simpler proof of universality is obtained, while in the latter case we find characterizations of finite and recursively enumerable languages (without using any squeezing mechanism, as it was necessary in the case of standard rules). The relationships with regular languages are also investigated.Ministerio de Educación y Ciencia TIN2005-09345-C03-01Junta de Andalucía TIC-58